import avlTree.AVLTree;


public class Test {
    static int[] arr = {1,2,3,5,3,4,9,10,-1,13};

    public static void inorder(AVLTree.TreeNode root) {
        if(root == null) return;
        if(root.left != null) inorder(root.left);
        System.out.print(root.val + " ");
        if(root.right != null) inorder(root.right);
    }
    public static void main(String[] args) {
        AVLTree avlTree = new AVLTree();
        for (int i = 0; i < arr.length; i++) {
            avlTree.insert(arr[i]);
        }
        inorder(avlTree.root);
    }
}
